Approximations for the waiting - time distribution in an M / P H / c priority queue
نویسندگان
چکیده
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a nonpreemptive M/P H/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiting time moments allow us to approximate the overall waiting time distribution per class. We subsequently apply these methods to real-life data in a case study.
منابع مشابه
Approximations for the waiting time distribution in an M/G/c priority queue
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiti...
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملM/G/1 Priority Queues
We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...
متن کاملAsymptotics for M/G/1 Low-Priority Waiting-Time Tail Probabilities
We consider the classical M/G/1 queue with two priority classes and the nonpreemptive and preemptive-resume disciplines. We show that the low-priority steady-state waiting-time can be expressed as a geometric random sum of i.i.d. random variables, just like the M/G/1 FIFO waiting-time distribution. We exploit this structures to determine the asymptotic behavior of the tail probabilities. Unlike...
متن کاملAPPROXIMATION OF THE MEAN WAITING TIME IN THE M / H 2 / s QUEUE
In this paper a closed formula to estimate the mean waiting time in the M/H2/s queue is presented. The proposed formula takes into account the first three moments of the H2 holding time distribution and is extremely easy to compute, while the accuracy is similar to other more complex approximations. The results presented here can be extended to calculate the mean waiting time in the M/G/s queue...
متن کامل